Tokens
نویسندگان
چکیده
منابع مشابه
On correspondence, line tokens and missing tokens
In this article, the authors expand on some of their previous work on correspondence and propose a system that can correspond in the presence of both point and line tokens, or a mix of them. It can also work if some tokens present in one frame are not present in the other. The proposed algorithm is an amalgamation of reductionist and holist paradigms. We establish that properties which remain i...
متن کاملSeparation of Circulating Tokens
Self-stabilizing distributed control is often modeled by token abstractions. A system with a single token may implement mutual exclusion; a system with multiple tokens may ensure that immediate neighbors do not simultaneously enjoy a privilege. For a cyber-physical system, tokens may represent physical objects whose movement is controlled. The problem studied in this paper is to ensure that a s...
متن کاملThe VNC-Tokens Dataset
Idiomatic expressions formed from a verb and a noun in its direct object position are a productive cross-lingual class of multiword expressions, which can be used both idiomatically and as a literal combination. This paper presents the VNC-Tokens dataset, a resource of almost 3000 English verb–noun combination usages annotated as to whether they are literal or idiomatic. Previous research using...
متن کاملNames as Tokens
After presenting a variety of arguments in support of the idea that ordinary names are indexical, I respond to John Perry’s recent arguments against the indexicality of names. I conclude by indicating some connections between the theory of names defended here and Wittgenstein’s observations on naming, and suggest that the latter may have been misconstrued in the literature.
متن کاملSwapping Labeled Tokens on Graphs
Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n) token swaps, and thus focus on the problem of minimizing the number of token swaps to reach the target tok...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Iowa Review
سال: 2001
ISSN: 0021-065X,2330-0361
DOI: 10.17077/0021-065x.5383